Selfish traffic allocation for server farms

We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a. the coordination ratio) and other (e.g., bicriteria) measures in the recently introduced game theoretic parallel links network model of Koutsoupias and Papadimitriou. We generalize this model toward general, monotone families of cost functions and cost functions from queueing theory. A summary of our main results for general, monotone cost functions is as follows: 1. We give an exact characterization of all cost functions having a bounded/unbounded price of anarchy. For example, the price of anarchy for cost functions describing the expected delay in queueing systems is unbounded. 2. We show that an unbounded price of anarchy implies an extremely high performance degradation under bicriteria measures. In fact, the price of selfish routing can be as high as a bandwidth degradation by a factor that is linear in the network size. 3. We separate the game theoretic (integral) allocation model from the (fractional) flow model by demonstrating that even a very small or negligible amount of integrality can lead to a dramatic performance degradation. 4. We unify recent results on selfish routing under different objectives by showing that an unbounded price of anarchy under the min-max objective implies an unbounded price of anarchy under the average cost objective and vice versa. Our special focus lies on cost functions describing the behavior of Web servers that can open only a limited number of Transmission Control Protocol (TCP) connections. In particular, we compare the performance of queueing systems that serve all incoming requests with servers that reject requests in case of overload. Our analysis indicates that all queueing systems without rejection cannot give any reasonable guarantee on the expected delay of requests under selfish routing even when the injected load is far away from the capacity of the system. In contrast, Web server farms that are allowed to reject requests can guarantee a high quality of service for every individual request stream even under relatively high injection rates

Traffic Network Optimum Principle - Minimum Probability of Congestion Occurrence

We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such a way that the probability for spontaneous occurrence of traffic breakdown at one of the network bottlenecks during a given observation time reaches the minimum possible value. Based on numerical simulations with a stochastic three-phase traffic flow model, we show that in comparison to the well-known Wardrop's principles the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains in the whole network.Comment: 22 pages, 6 figure

The problem of shot selection in basketball

In basketball, every time the offense produces a shot opportunity the player with the ball must decide whether the shot is worth taking. In this paper, I explore the question of when a team should shoot and when they should pass up the shot by considering a simple theoretical model of the shot selection process, in which the quality of shot opportunities generated by the offense is assumed to fall randomly within a uniform distribution. I derive an answer to the question "how likely must the shot be to go in before the player should take it?", and show that this "lower cutoff" for shot quality $f$ depends crucially on the number $n$ of shot opportunities remaining (say, before the shot clock expires), with larger $n$ demanding that only higher-quality shots should be taken. The function $f(n)$ is also derived in the presence of a finite turnover rate and used to predict the shooting rate of an optimal-shooting team as a function of time. This prediction is compared to observed shooting rates from the National Basketball Association (NBA), and the comparison suggests that NBA players tend to wait too long before shooting and undervalue the probability of committing a turnover.Comment: 7 pages, 2 figures; comparison to NBA data adde

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by a strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.Comment: 4 pages, 4 figures, final revised versio

Price of anarchy on heterogeneous traffic-flow networks

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the `price of anarchy'. This is the ratio of the cost incurred by agents who act to minimise their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability - parameterised by the proportion of variable-cost links in the network - changes, the behaviours that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of non-overlapping paths connecting source to destination nodes that are characterised by the number of variable-cost edges they contain. It is shown that localised peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect-ratio, variability and traffic load

On Unbounded Composition Operators in L2L^2-Spaces

Fundamental properties of unbounded composition operators in $L^2$-spaces are studied. Characterizations of normal and quasinormal composition operators are provided. Formally normal composition operators are shown to be normal. Composition operators generating Stieltjes moment sequences are completely characterized. The unbounded counterparts of the celebrated Lambert's characterizations of subnormality of bounded composition operators are shown to be false. Various illustrative examples are supplied

La asociación : revista de primera enseñanza: Año XI Número 541 - (07/07/23)

There have been few new therapies for patients with chronic kidney disease in the last decade. However, the management of patients affected by genetic kidney disease is rapidly evolving. Inherited or genetic kidney disease affects around 10% of adults with end-stage kidney disease and up to 70% of children with early onset kidney disease. Advances in next-generation sequencing have enabled rapid and cost-effective sequencing of large amounts of DNA. Next-generation sequencing-based diagnostic tests now enable identification of a monogenic cause in around 20% of patients with early-onset chronic kidney disease. A definitive diagnosis through genomic testing may negate the need for prolonged diagnostic investigations and surveillance, facilitate reproductive planning and provide accurate counselling for at-risk relatives. Genomics has allowed the better understanding of disease pathogenesis, providing prognostic information and facilitating development of targeted treatments for patients with inherited or genetic kidney disease. Although genomic testing is becoming more readily available, there are many challenges to implementation in clinical practice. Multidisciplinary renal genetics clinics serve as a model of how some of these challenges may be overcome. Such clinics are already well established in most parts of Australia, with more to follow in future. With the rapid pace of new technology and gene discovery, collaboration between expert clinicians, laboratory and research scientists is of increasing importance to maximize benefits to patients and health-care systems

The Hot (Invisible?) Hand: Can Time Sequence Patterns of Success/Failure in Sports Be Modeled as Repeated Random Independent Trials?

The long lasting debate initiated by Gilovich, Vallone and Tversky in is revisited: does a “hot hand” phenomenon exist in sports? Hereby we come back to one of the cases analyzed by the original study, but with a much larger data set: all free throws taken during five regular seasons () of the National Basketball Association (NBA). Evidence supporting the existence of the “hot hand” phenomenon is provided. However, while statistical traces of this phenomenon are observed in the data, an open question still remains: are these non random patterns a result of “success breeds success” and “failure breeds failure” mechanisms or simply “better” and “worse” periods? Although free throws data is not adequate to answer this question in a definite way, we speculate based on it, that the latter is the dominant cause behind the appearance of the “hot hand” phenomenon in the data

Sachet water quality and product registration : a cross-sectional study in Accra, Ghana

The study's objectives were to assess the extent to which packaged water producers follow product registration procedures and to assess the relationship between product registration and drinking water quality in Accra, Ghana. Following preliminary analysis of a national water quality survey, 118 packaged sachet water samples were collected by sampling all brands sold by 66 vendors. A sample of vendors was selected from two high-income and two low-income areas of Accra, Ghana. Sachet packaging and labelling details were recorded and compared to a regulatory database to assess product registration. All samples were weighed and tested for faecal indicator bacteria and selected physico-chemical parameters. Product registration numbers and brand names could be matched to regulatory records for 77 of 118 sachets (65.2%). All samples tested were compliant with national water quality standards for faecal indicator bacteria and nitrate. Brand registration was not associated with any of the quality indicators considered. The results of this study suggest that while a substantial proportion of sachet water is sold without formal product registration, the microbial quality of the unlicensed water is consistently high in Accra, Ghana. Further examination of regulatory enforcement and monitoring will be needed to ensure sustained high water quality over time

Computation of Equilibrium Distributions of Markov Traffic-Assignment Models

Markov traffic-assignment models explicitly represent the day-to-day evolving interaction between traffic congestion and drivers' information acquisition and choice processes. Such models can, in principle, be used to investigate traffic flows in stochastic equilibrium, yielding estimates of the equilibrium mean and covariance matrix of link or route traffic flows. However, in general these equilibrium moments cannot be written down in closed form. While Monte Carlo simulations of the assignment process may be used to produce “empirical” estimates, this approach can be extremely computationally expensive if reliable results (relatively free of Monte Carlo error) are to be obtained. In this paper an alternative method of computing the equilibrium distribution is proposed, applicable to the class of Markov models with linear exponential learning filters. Based on asymptotic results, this equilibrium distribution may be approximated by a Gaussian process, meaning that the problem reduces to determining the first two multivariate moments in equilibrium. The first of these moments, the mean flow vector, may be estimated by a conventional traffic-assignment model. The second, the flow covariance matrix, is estimated through various linear approximations, yielding an explicit expression. The proposed approximations are seen to operate well in a number of illustrative examples. The robustness of the approximations (in terms of network input data) is discussed, and shown to be connected with the “volatility” of the traffic assignment process